Cramer-Rao bounds for blind multichannel estimation
نویسندگان
چکیده
Certain blind channel estimation techniques allow the identification of the channel up to a scale or phase factor. This results in singularity of the Fisher Information Matrix (FIM). The Cramér–Rao Bound, which is the inverse of the FIM, is then not defined. To regularize the estimation problem, one can impose constraints on the parameters. In general, many sets of constraints are possible but are not always relevant. We propose a constrained CRB, the pseudo-inverse of the FIM, which gives, for a minimum number of constraints, the lowest bound on the mean squared estimation error.
منابع مشابه
Exact Cramer-Rao Bounds for Semi-blind Channel Estimation in Amplify-and-Forward Two-Way Relay Networks
In this paper, we derive the exact Cramer-Rao bounds (CRBs) for semi-blind channel estimation in amplifyand-forward two-way relay networks employing square QAM modulation. The derived bounds are used to show that the semiblind approach, which exploits both the transmitted pilots and transmitted data symbols, can provide substantial improvements in estimation accuracy over the training-based app...
متن کاملBayesian Cramer-Rao bounds for complex gain parameters estimation of slowly varying Rayleigh channel in OFDM systems
This paper deals with on-line Bayesian Cramer-Rao (BCRB) lower bound for complex gains dynamic estimation of time-varying multi-path Rayleigh channels. We propose three novel lower bounds for 4QAM OFDM systems in case of negligible channel variation within one symbol, and assuming both channel delay and Doppler frequency related information. We derive the true BCRB for data-aided (DA) context a...
متن کاملApproximate estimation of the Cramer-Rao Lower Bound for Sinusoidal Parameters
-In this paper we present new approximation expressions for the Cramer-Rao Lower Bound on unbiased estimates of frequency, phase, amplitude and DC offset for uniformly sampled signal embedded in white-Gaussian noise. This derivation is based on well-known assumptions and a novel set of approximations for finite series of trigonometric functions. The estimated Cramer-Rao Lower Bounds are given i...
متن کاملComputation of a useful Cramer-Rao bound for multichannel ARMA parameter estimation
It has been shown earlier that the problem of multichannel autoregressive moving average (ARMA) parameter estimation can be tackled in a computationally efficient way by converting the given process into an equivalent scalar, periodic ARMA process. This correspondence presents methods to compute the Cramer-Rao bound associated with the identification of the scalar ARMA equivalent of a given mul...
متن کاملImproved Cramer-Rao Inequality for Randomly Censored Data
As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censor...
متن کامل